On a Characterization of Spaces of Differentiable Functions

In this paper, we generalize Bernstein's theorem characterizing the space by means of local approximations. The closed interval is partitioned into disjoint half-intervals on which best approximation polynomials of degree divided by the lengths of these half-intervals taken to the power are considered. The existence of the limits of these ratios as the lengths of the half-intervals tend to zero is a criterion for the existence of the th derivative of a function. We prove the theorem in a stronger form and extend it to the spaces .     

Uniform convexity of ψ-direct sums of Banach spaces

Let X and Y be Banach spaces and ψ a continuous convex function on the unit interval [0,1] satisfying certain conditions. Let X⊕_ψY be the direct sum of X and Y equipped with the associated norm with ψ. We show that X⊕_ψY is uniformly convex if and only if X,Y are uniformly convex and ψ is strictly convex. As a corollary we obtain that the ?_p,q-direct sum (not p=q=1 nor ∞), is uniformly convex if and only if X,Y are, where ?_p,q is the Lorentz sequence space. These results extend the well-known fact for the ?_p-sum . Some other examples are also presented.     

Boundary behavior of the Bergman kernel function on pseudoconvex domains with comparable Levi form

Let Ω be a smoothly bounded pseudoconvex domain in and let be a point of finite type. We also assume that the Levi form of bΩ is comparable in a neighborhood of z₀. Then we get a quantity which bounds from above and below the Bergman kernel function in a small constant and large constant sense.     

Extending the Balas-Yu bounds on the number of maximal independent sets in graphs to hypergraphs and lattices

A result of Balas and Yu (1989) states that the number of maximal independent sets of a graph G is at most ^p+1, where is the number of pairs of vertices in G at distance 2, and p is the cardinality of a maximum induced matching in G. In this paper, we give an analogue of this result for hypergraphs and, more generally, for subsets of vectors in the product of n lattices =₁××_n, where the notion of an induced matching in G is replaced by a certain binary tree each internal node of which is mapped into . We show that our bounds may be nearly sharp for arbitrarily large hypergraphs and lattices. As an application, we prove that the number of maximal infeasible vectors x=₁××_n for a system of polymatroid inequalities does not exceed max{Q,^logt/c(2Q,)}, where is the number of minimal feasible vectors for the system, , , and c(,) is the unique positive root of the equation 2^c(^c/log–1)=1. This bound is nearly sharp for the Boolean case ={0,1}ⁿ, and it allows for the efficient generation of all minimal feasible sets to a given system of polymatroid inequalities with quasi-polynomially bounded right-hand sides . This research was supported by the National Science Foundation (Grant IIS-0118635), and by the Office of Naval Research (Grant N00014-92-J-1375). The second and third authors are also grateful for the partial support by DIMACS, the National Science Foundation's Center for Discrete Mathematics and Theoretical Computer Science.Mathematics Subject Classification (2000):20E28, 20G40, 20C20     

Large Deviations of Empirical Measures Under Symmetric Interaction

We prove the large deviation principle for the joint empirical measure of pairs of random variables which are coupled by a totally symmetric interaction. The rate function is given by an explicit bilinear expression, which is finite only on product measures and hence is non-convex.     

非负Ricci曲率开流形的拓扑

我们证明了对于具有非负Rieei曲率,大体积增长且内半径下有界的完备n维Riemann流形,只要存在常数C>0使得 则它微分同胚于欧式空间Rn.我们还证明了在某些pinching条件下具有非负射线曲率的完备n维Riemarm流形微分同胚与Rn,改进了已知的结果.     

A continuous parametric shape model

In this paper we propose a flexible continuous parametric shape model for star-shaped planar objects. The model is based on a polar Fourier expansion of the normalized radius-vector function. The expected phase amplitudes are modelled by a simple regression with parameters having nice geometric interpretations. The suggestedgeneralized p-order model is an extension of first- and second-order Gaussian shape models, and in particular the Gaussian assumption is relaxed. The statistical analysis is straightforward, as demonstrated by an application concerning shape discrimination of two cell nuclei populations.     

The Topology of Algebra: Combinatorics of Squaring

We study the graph each of whose edges connects an element of a given ring with the square of itself. For a finite commutative group (e.g., for the multiplicative group of coprime residue classes modulo a positive integer), we describe this graph explicitly: each of its connected components is an oriented attracting cycle equipped with identical -vertex rooted trees of special form whose roots reside on the cycle. We also compute the graphs of permutation groups on not too many elements and of the subgroups of even permutations; the connected components of these graphs are also uniformly equipped cycles.     

Vector Equilibrium Problems Under Asymptotic Analysis

Given a closed convex set K in Rⁿ; a vector function F:K×K R^m; a closed convex (not necessarily pointed) cone P(x) in ^m with non-empty interior, PP(x) Ø, various existence results to the problemfind xK such that F(x,y)- int P(x) y K under P(x)-convexity/lower semicontinuity of F(x,) and pseudomonotonicity on F, are established. Moreover, under a stronger pseudomonotonicity assumption on F (which reduces to the previous one in case m=1), some characterizations of the non-emptiness of the solution set are given. Also, several alternative necessary and/or sufficient conditions for the solution set to be non-empty and compact are presented. However, the solution set fails to be convex in general. A sufficient condition to the solution set to be a singleton is also stated. The classical case P(x)=^m ₊ is specially discussed by assuming semi-strict quasiconvexity. The results are then applied to vector variational inequalities and minimization problems. Our approach is based upon the computing of certain cones containing particular recession directions of K and F.     

Estimates of Entire Functions of Exponential Type Less than π in Terms of Logarithmic Sums over Real Duffin and Schaeffer Sequences

We give uniform estimates of entire functions of exponential type less than having sufficiently small logarithmic sums over real sequences { _n } satisfying | _n –n|L and _n+1– _n for fixed positive constants L and . We thereby generalize results about logarithmic sums over the set of integers and so-called relatively h-dense sequences.